Sojourn time asymptotics in the MG1 processor sharing queue
نویسندگان
چکیده
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution. We show how the moments of the sojourn time can be calculated recursively and prove that the kth moment of the sojourn time is finite iff the kth moment of the service time is finite. In addition, we give a short proof of a heavy traffic theorem for the sojourn time distribution, prove a heavy traffic theorem for the moments of the sojourn time, and study the properties of the heavy traffic limiting sojourn time distribution when the service time distribution is regularly varying. Explicit formulas and multiterm expansions are provided for the case that the service time has a Pareto distribution.
منابع مشابه
A Stochastic Mean-Value Method for the Derivation of Delay Asymptotics in Heavy-Tailed Processor-Sharing Systems
We develop a stochastic mean-value method for the derivation of delay asymptotics in Processor-Sharing (PS) type systems with heavy-tailed service requirements. In order to demonstrate the strength of the approach, we apply the method to obtain the sojourn time asymptotics for a multi-class G/G/1 queue operating under the Discriminatory Processor-Sharing (DPS) discipline. Besides interesting fr...
متن کاملSojourn time asymptotics in Processor Sharing queues with varying service rate
This paper addresses the sojourn time asymptotics for a GI/GI/• queue operating under the Processor Sharing (PS) discipline with stochastically varying service rate. Our focus is on the logarithmic estimates of the tail of sojourn-time distribution, under the assumption that the jobsize distribution has a light tail. Whereas upper bounds on the decay rate can be derived under fairly general con...
متن کاملEstimating mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information
We seek to approximate the mean sojourn time in the processor sharing M/G/1 queue with inaccurate job size information. Suppose we are given the arrival rate λ and random service time Ŝ = SX where X ∼ LN(0, σ) represents the inaccuracy. Denote the mean sojourn time in an M/G/1 queue with processor sharing with service time Ŝ by E(T̂) and with service time S by E(T). Finally, E(T̂) denotes the mea...
متن کاملSojourn Time Asymptotics in the M / G / 1 Processor Sharing
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index ?, non-integer, ii the sojourn time distribution is regularly varying of index ?. This result is derived from a new expression for the Laplace-Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution. We ...
متن کاملTail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements
We derive the sojourn time asymptotics for a multi-class G/G/1 queue with regularly varying service requirements operating under the Discriminatory ProcessorSharing (DPS) discipline. DPS provides a natural approach for modelling the flowlevel performance of differentiated bandwidth-sharing mechanisms. Under certain assumptions, we prove that the service requirement and sojourn time of a given c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 35 شماره
صفحات -
تاریخ انتشار 2000